Adaptive E-learning using Deterministic Finite Automata
نویسندگان
چکیده
Adaptive E-learning refers to adapt the way of presentation of educational material according to the student's needs. Understanding ability differs by student to student so the learning path should vary according to their understanding ability. Some students may understand by once some may needs more with different way. This paper represents a same topic with various approaches to the different classes of students with different understanding ability. The proposed approach in this paper is based on two concepts Deterministic Finite Automata (DFA) and Case Based Study (CBS), out of which DFA used for providing adaptive nature and shows the state transition according to their performance. Path of leaning varies with different student for a particular topic, this feature used to provide adaptively nature in E-learning. CBS used for providing study material based on the state. CBS uses case library to decide the study material.
منابع مشابه
Reduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کاملLearning non-deterministic finite automata from queries and counterexamples
In the recent theoretical research activity of inductive learning, in particular, of inductive inference, Angluin has introduced the model of learning called minimally adequate teacher (MAT), that is, the model of learning via membership queries and equivalence queries, and has shown that the class of regular languages is e ciently learnable using deterministic nite automata (DFAs) (Angluin 198...
متن کاملThe Learnability of Simple Deterministic Finite-memory Automata via Queries
In this paper, we establish the learnability of simple deterministic finitememory automata via membership and equivalence queries. Sim ple deterministic fmitememory automata are a subclass of finitememory automata introduced by Kaminski and Francez (1994) as a model gen eralizing finite automata to infinite alphabets. Continuously, Sakamoto and Ikeda investigated several decision problems for f...
متن کاملAngluin-Style Learning of NFA
This paper introduces NL, a learning algorithm for inferring non-deterministic finite-state automata using membership and equivalence queries. More specifically, residual finite-state automata (RFSA) are learned similar as in Angluin’s popular L algorithm, which however learns deterministic finite-state automata (DFA). As RFSA can be exponentially more succinct than DFA, RFSA are the preferable...
متن کاملLearning Regular Languages via Alternating Automata
Nearly all algorithms for learning an unknown regular language, in particular the popular L∗ algorithm, yield deterministic finite automata. It was recently shown that the ideas of L∗ can be extended to yield non-deterministic automata, and that the respective learning algorithm, NL∗, outperforms L∗ on randomly generated regular expressions. We conjectured that this is due to the existential na...
متن کامل